Probabilistic Logic Programming under Inheritance with Overriding Probabilistic Logic Programming under Inheritance with Overriding

We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which are obtained from the classical notion of logical entailment by adding inheritance with overriding. This is done by using recent approaches to probabilistic default reasoning with conditional constraints. We analyze the semantic properties of the new entailment relations. We also present algorithms for probabilistic logic programming under inheritance with overriding, and we analyze its complexity in the propositional case. 1Institut und Ludwig Wittgenstein Labor für Informationssysteme, TU Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria. E-mail: [email protected]. Acknowledgements: I am very grateful to Gabriele Kern-Isberner for valuable comments on an earlier version of this paper. This work has been supported by a DFG grant and the Austrian Science Fund under project N Z29-INF. Copyright c 2001 by the authors 2 INFSYS RR 1843-01-05